Constraint Optimization Techniques for MultiObjective Branch and Bound Search
نویسندگان
چکیده
منابع مشابه
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of efficiently combining these techniques with branch and bound for solving certain types of constraint optimization problems (COPs). Our new method significantly reduces the overhead of performing decomposition during search ...
متن کاملIntegrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance, which are instances of the symmetry detection by dominance detection approach for pruning symmetric nodes in the MKP branch-and-bound search...
متن کاملSet Branching in Constraint Optimization
Branch and bound is an effective technique for solving constraint optimization problems (COP’s). However, its search space expands very rapidly as the domain sizes of the problem variables grow. In this paper, we present an algorithm that clusters the values of a variable’s domain into sets. Branch and bound can then branch on these sets of values rather than on individual values, thereby reduc...
متن کاملFull Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains
Consistency techniques proved to be an efficient method for reducing the search space of CSP. Several consistency techniques were proposed for soft constraint frameworks too. In this paper, we propose a full arc consistency (FAC) for weighted CSP (WCSP) and an algorithm for enforcing FAC and maintaining it during Branch & Bound search. We also define the transformation of constraint hierarchies...
متن کاملBounded Search and Symbolic Inference for Constraint Optimization
Constraint optimization underlies many problems in AI. We present a novel algorithm for finite domain constraint optimization that generalizes branch-and-bound search by reasoning about sets of assignments rather than individual assignments. Because in many practical cases, sets of assignments can be represented implicitly and compactly using symbolic techniques such as decision diagrams, the s...
متن کامل